67 research outputs found
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
We consider geometric instances of the Maximum Weighted Matching Problem
(MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000
vertices. Making use of a geometric duality relationship between MWMP, MTSP,
and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields
in near-linear time solutions as well as upper bounds. Using various
computational tools, we get solutions within considerably less than 1% of the
optimum.
An interesting feature of our approach is that, even though an FWP is hard to
compute in theory and Edmonds' algorithm for maximum weighted matching yields a
polynomial solution for the MWMP, the practical behavior is just the opposite,
and we can solve the FWP with high accuracy in order to find a good heuristic
solution for the MWMP.Comment: 20 pages, 14 figures, Latex, to appear in Journal of Experimental
Algorithms, 200
A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
In a recent issue of this journal, Mordukhovich et al.\ pose and solve an
interesting non-differentiable generalization of the Heron problem in the
framework of modern convex analysis. In the generalized Heron problem one is
given closed convex sets in \Real^d equipped with its Euclidean norm
and asked to find the point in the last set such that the sum of the distances
to the first sets is minimal. In later work the authors generalize the
Heron problem even further, relax its convexity assumptions, study its
theoretical properties, and pursue subgradient algorithms for solving the
convex case. Here, we revisit the original problem solely from the numerical
perspective. By exploiting the majorization-minimization (MM) principle of
computational statistics and rudimentary techniques from differential calculus,
we are able to construct a very fast algorithm for solving the Euclidean
version of the generalized Heron problem.Comment: 21 pages, 3 figure
Multi-class Model Fitting by Energy Minimization and Mode-Seeking
We propose a general formulation, called Multi-X, for multi-class
multi-instance model fitting - the problem of interpreting the input data as a
mixture of noisy observations originating from multiple instances of multiple
classes. We extend the commonly used alpha-expansion-based technique with a new
move in the label space. The move replaces a set of labels with the
corresponding density mode in the model parameter domain, thus achieving fast
and robust optimization. Key optimization parameters like the bandwidth of the
mode seeking are set automatically within the algorithm. Considering that a
group of outliers may form spatially coherent structures in the data, we
propose a cross-validation-based technique removing statistically insignificant
instances. Multi-X outperforms significantly the state-of-the-art on publicly
available datasets for diverse problems: multiple plane and rigid motion
detection; motion segmentation; simultaneous plane and cylinder fitting; circle
and line fitting
Amoeba Techniques for Shape and Texture Analysis
Morphological amoebas are image-adaptive structuring elements for
morphological and other local image filters introduced by Lerallut et al. Their
construction is based on combining spatial distance with contrast information
into an image-dependent metric. Amoeba filters show interesting parallels to
image filtering methods based on partial differential equations (PDEs), which
can be confirmed by asymptotic equivalence results. In computing amoebas, graph
structures are generated that hold information about local image texture. This
paper reviews and summarises the work of the author and his coauthors on
morphological amoebas, particularly their relations to PDE filters and texture
analysis. It presents some extensions and points out directions for future
investigation on the subject.Comment: 38 pages, 19 figures v2: minor corrections and rephrasing, Section 5
(pre-smoothing) extende
- …